Using the Quality-Time Tradeo in Local Optimization
نویسنده
چکیده
The paper introduces duty measure for optimization methods. Duty expresses the relationship between the quality of the result and the time required to obtain the result. The usefulness of the duty measure is demonstrated on a case study involving a local optimization of a large traveling salesman problem. Using duty, a deterministic method and a probabilistic method are combined into a hybrid method. The hybrid method exhibits the best quality-time tradeoo of the three methods. The performance of the hybrid method is analyzed and some future research questions are addressed.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملLocal modeling optimization for time series prediction
The diÆculty of predicting time series generated by chaotic systems has motivated the development of many time series prediction algorithms. Among these local models have emerged as one of the most accurate methods. A weakness of local models is their sensitivity to the choice of user selected parameters such as the size of the neighborhood, the embedding dimension, and the distance metric. Thi...
متن کاملQuality of Service Speci cation for Multimedia Presentations
The bandwidth limitations of multimedia systems force tradeo s between presentation data delity and real-time performance. For example, digital video is commonly encoded with lossy compression to reduce bandwidth and frames may be skipped during playback to maintain synchronization. These tradeo s depend on device performance and physical data representations that are hidden by a database syste...
متن کامل